Lecture @ MPRI Paris Master of Computer Science (Université Paris Diderot) by Nicolas Schabanel
Feb 16, 2011 - 16:15-19:15 - Exhaustive Sampling
• Exhaustive guessing: a polynomial time randomized (1+ε)-approximation (PTRAS) for Max-CUT in dense graphs
